package dp;

public class minDistance {
    public int minDistance(String word1, String word2) {
        char[] nums1 = word1.toCharArray();
        char[] nums2 = word2.toCharArray();
        int len1 = nums1.length;
        int len2 = nums2.length;
        int[][] dp = new int[len1 + 1][len2 + 1];
        for (int i = 0; i <= nums1.length; i++) {
            dp[i][0] = i;
        }
        for (int i = 0; i <= nums2.length; i++) {
            dp[0][i] = i;
        }
        for (int i = 1; i <= len1; i++) {
            for (int j = 1; j <= len2; j++) {
                if (nums1[i - 1] != nums2[j - 1]){
                    dp[i][j] = Math.min(Math.min(dp[i - 1][j - 1] + 2, dp[i][j - 1] + 1), dp[i - 1][j] + 1);
                } else {
                    dp[i][j] = dp[i - 1][j - 1];
                }
            }
        }
        return dp[len1][len2];
    }
}
